Structured Decomposition for Reversible Boolean Functions
نویسندگان
چکیده
منابع مشابه
Unate Decomposition of Boolean Functions
We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks to obtain a good initial structure for logic synthesis. The input to our algorithm is a flattened netlist. The output is a multi-level netlist that can be efficiently implemented using a logic synthesis tool. Experimental results on Espresso PLA benchmarks employing a...
متن کاملOn the Decomposition of Boolean Functions via Boolean Equations
We propose an alternative solution to the problems solved in [1]. Our aim is to advocate the efficiency of algebraic methods for the solution of the Boolean equations which occur in the decomposition of Boolean functions.
متن کاملDecomposition of Multi-Output Boolean Functions∗
In this paper the problem of decomposition, mapping and minimization of multi-output boolean functions is discussed. First the mathematical formulation for single-output boolean functions is presented and then it is extended to multi-output functions. The proposed formulations use function decompositions, ETDDs (EXOR ternary decision diagrams) and multi-valued logic.
متن کاملDecomposition of Boolean Functions Specified by Cubes
We study the problem of decomposing a Boolean function into a set of functions with fewer arguments. This problem has considerable practical importance in VLSI, for example, for designs using field-programmable gate arrays. The decomposition problem is old, and well understood when the function to be decomposed is specified by a truth table, or has one output only. However, modern design tools ...
متن کاملDecomposition of Boolean Functions Speciied by Cubes
We study the problem of decomposing a Boolean function into a set of functions with fewer arguments. This problem has considerable practical importance in VLSI. For example, for digital circuits designed with eld-programmable gate arrays, it is necessary to express Boolean functions in terms of`smaller' functions that t the cells of the array. The decomposition problem is old, and well understo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2020
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2019.2928974